#include<bits/stdc++.h>
using namespace std;

#define int long long 

const int N = 1e5 + 5;

int n;
int a[N];

void solve()
{
    cin >> n;
    for(int i = 1;i <= n;i++)
        cin >> a[i];
    sort(a+1,a+n+1);
    deque<int>q;
    for(int i = 1;i <= n;i++)
    {
        if(q.size())
        {
            int x = q.front();
            if(x < a[i])
            {
                q.pop_front();
                q.push_back(a[i]);
            }
            else
            {
                q.push_back(a[i]);
            }
        }
        else
        {
            q.push_back(a[i]);
            continue;
        }
    }
    cout << q.size() << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int Test_case=1;
    while(Test_case--)solve();
    return 0;
}